The irace package: Iterated racing for automatic algorithm configuration
نویسندگان
چکیده
منابع مشابه
The irace Package: Iterated Racing for Automatic Algorithm Configuration
The irace package implements the iterated racing procedure, which is an extension of Iterated F-race (I/F-Race). The main use of irace is the automatic configuration of optimization algorithms, that is, finding the most appropriate settings of an optimization algorithm given a set of instances of an optimization problem. It builds upon the race package by Birattari and it is implemented in R. T...
متن کاملThe irace Package: Iterated Race for Automatic Algorithm Configuration
The program irace implements the iterated racing procedure, which is an extension of the Iterated F-race procedure (I/F-Race). Its main purpose is to automatically configure optimization algorithms by finding the most appropriate settings given a set of instances of an optimization problem. It builds upon the race package by Birattari and it is implemented in R. This revision documents irace ve...
متن کاملAutomatic Configuration of GCC Using Irace
Automatic algorithm configuration techniques have proved to be successful in finding performance-optimizing parameter settings of many search-based decision and optimization algorithms. A re-current, important step in software development is the compilation of source code written in some programming language into machine-executable code. The generation of performance-optimized machine code itse...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOn the Potential of Automatic Algorithm Configuration
Design and implementation of efficient and robust algorithms are core topics of computer science and operations research, and the determination of appropriate values for free algorithm parameters is a challenging and tedious task in the design of effective algorithms for hard problems. Such parameters include categorical choices (e.g., neighborhood structure in local search or variable/value or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Perspectives
سال: 2016
ISSN: 2214-7160
DOI: 10.1016/j.orp.2016.09.002